HTN Planning: Complexity and Expressivity
نویسندگان
چکیده
Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) d ecomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks. networks are required to be totally ordered, and (3) whether variables are allowed. From this table, we can draw the following conclusions:
منابع مشابه
Hierarchical Planning: Relating Task and Goal Decomposition with Task Sharing
Considerable work has focused on enhancing the semantics of Hierarchical Task Networks (HTNs) in order to advance the state-of-the-art in hierarchical planning. For instance, the Hierarchical Goal Network (HGN) formalism operates over a hierarchy of goals to facilitate tighter integration of decompositional planning with classical planning. Another example is the Action Notation Markup Language...
متن کاملSemantics for Hierarchical Task Network Planning
One big obstacle to understanding the nature of hierarchical task net work htn planning has been the lack of a clear theoretical framework In particular no one has yet presented a clear and concise htn algorithm that is sound and complete In this paper we present a formal syntax and se mantics for htn planning Based on this syntax and semantics we are able to de ne an algorithm for htn planning...
متن کاملCs - Tr - 3239 , Umiacs
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise htn algorithm that is sound and complete. In this paper, we present a formal syntax and semantics for htn planning. Based on this syntax and semantics, we are able to de ne an algorithm for htn pl...
متن کاملExpressivity of STRIPS-Like and HTN-Like Planning
It is widely believed, that the expressivity of STRIPS and STRIPS-like planning based on actions is generally lower than the expressivity of Hierarchical Task Network (HTN) and HTN-like planning, based on hierarchical decomposition. This would mean that a HTN-like planner can generally solve more domains than a STRIPS-like planner with the same extensions. In this paper, we show that both appro...
متن کاملCs - Tr - 3239 , Umiacs - Tr
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise htn algorithm that is sound and complete. In this paper, we present a formal syntax and semantics for htn planning. Based on this syntax and semantics, we are able to deene an algorithm for htn pl...
متن کامل